public class TestDemo {

    public static void main(String[] args) {
        BinaryTree tree = new BinaryTree();
        TreeNode node = tree.createTree();
        System.out.println(tree.size(node));
        System.out.println(tree.size1(node));
        System.out.println(tree.getLeafNodeCount(node));
        System.out.println(tree.getLeafNodeCount1(node));
        System.out.println(tree.getLevelNodeCount(node, 2));
        System.out.println(tree.getHeight(node));
        System.out.println(tree.find(node, 'A').val);
        System.out.println(tree.isCompleteTree(node));
    }

    public static void main1(String[] args) {
        BinaryTree tree = new BinaryTree();
        TreeNode node = tree.createTree();
        tree.preOrder(node);
        System.out.println();
        System.out.println(tree.preOrder1(node));
        tree.inOrder(node);
        System.out.println();
        System.out.println(tree.inOrder1(node));
        tree.postOrder(node);
        System.out.println();
        System.out.println(tree.postOrder1(node));
    }
}
